Persistently Feasible Robust Safe Control by Safety Index Synthesis and Convex Semi-Infinite Programming
نویسندگان
چکیده
Model mismatches prevail in real-world applications. Ensuring safety for systems with uncertain dynamic models is critical. However, existing robust safe controllers may not be realizable when control limits exist. And methods use loose over-approximation of uncertainties, leading to conservative controls. To address these challenges, we propose a control-limits aware framework bounded state-dependent uncertainties. We index synthesis find controller guaranteed under limits. solve via Convex Semi-Infinite Programming, which the tightest formulation convex uncertainties and leads least control. In addition, analyze how can preserved unmodeled Experiment results show that our always much less than strong baselines.
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملa numerical approach for optimal control model of the convex semi-infinite programming
in this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. in final, numerical examples are provided for illustration of the purposed method.
متن کاملAn Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed. Both primal and dual convergence results are established under some basic assumptions. Numerical examples are also included to illustrate this approach.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملPenalty and Smoothing Methods for Convex Semi-Infinite Programming
In this paper we consider min-max convex semi-infinite programming. In order to solve these problems we introduce a unified framework concerning Remez-type algorithms and integral methods coupled with penalty and smoothing methods. This framework subsumes well-known classical algorithms, but also provides some new methods with interesting properties. Convergence of the primal and dual sequences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE control systems letters
سال: 2023
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2022.3231970